Latency Hiding in Dynamic Partitioning and Load Balancing of Grid Computing Applications
نویسندگان
چکیده
The b_formation Power Grid (IPG) concept developed by NASA is aimed to provide a metacomputing platform for large-scale distributed computations, by hiding the intricacies of a highly heterogeneous environment and yet maintaining adequate security. In this paper, we propose a latency-tolerant partitioning scheme that dynamically balances processor workloads on the !PG, and minimizes data movement and runtime communication. By simulating an unsteady adaptive mesh application on a wide area network, we study the performance of our load balancer under the Globus environment. The number of IPG nodes, the number of processors per node, attd the interconnect speeds are paramelerized to derive conditions under which the IPG would be suitable for parallel distributed processing of such applications. Experimental results demonstrate that effective solutions are achieved when the 1PG nodes are connected by a high-speed asynchronous interconnec!i.o, _:et,;'ork.
منابع مشابه
Performance enhancement strategies for multi-block overset grid CFD applications
The overset grid methodology has significantly reduced time-to-solution of highfidelity computational fluid dynamics (CFD) simulations about complex aerospace configurations. The solution process resolves the geometrical complexity of the problem domain by using separately generated but overlapping structured discretization grids that periodically exchange information through interpolation. How...
متن کاملDynamic Structured Grid Hierarchy Partitioners Using Inverse Space-Filling Curves
This paper discusses partitioning of dynamic structured grid hierarchies, occuring in structured adaptive mesh re nement (SAMR) applications. When a SAMR method is executed on a parallel computer, the work load will change dynamically. Thus, there is need for dynamic load balancing. Inverse spacelling curve partitioning (ISP) is appealing for load balancing in parallel SAMR, because of its spee...
متن کاملDynamic load balancing for large-scale adaptive finite element computation
For the parallel computation of partial differential equations, one key is the grid partitioning. It requires that each process owns the same amount of computations, and also, the partitioning quality should be proper to reduce the communications among processes. When calculating the partial differential equations using adaptive finite element methods, the grid and the basis functions adjust in...
متن کاملDynamic Load Balancing with theRe nement - Tree Partition
Dynamic load balancing is considered in the context of adaptive multilevel methods for partial diierential equations on networks of workstations or PCs. An approach that periodically repartitions the grid is taken. A partitioning algorithm based on the reenement tree of the adaptive grid is presented and analyzed in terms of the most important properties of grid partitioners.
متن کاملParallel Dynamic Grid Refinement for Industrial Applications
This paper covers a description of the algorithms and data-structures used in the parallel DLR TAU-Code Adaptation tool. Attention is given to the basic algorithms of the parallel anisotropic refinement and de-refinement, as well as the data-structures for distributed grids and grid hierarchy. The parallelization issues for distributed data are discussed along with the dynamic repartitioning an...
متن کامل